Note: On the two‐machine no‐idle flowshop problem

In this short note we study a two‐machine flowshop scheduling problem with the additional no‐idle feasibility constraint and the total completion time criterion function. We show that one of the few papers which deal with this special problem contains incorrect claims and suggest a way how these claims can be rectified. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47:353–358, 2000     

Local search methods for the discrete time/resource trade-off problem in project networks

In this paper we consider the discrete time/resource trade-off problem in project networks. Given a project network consisting of nodes (activities) and arcs (technological precedence relations), in which the duration of the activities is a discrete, nonincreasing function of the amount of a single renewable resource committed to it, the discrete time/resource trade-off problem minimizes the project makespan subject to precedence constraints and a single renewable resource constraint. For each activity, a work content is specified such that all execution modes (duration/resource requirement pairs) for performing the activity are allowed as long as the product of the duration and the resource requirement is at least as large as the specified work content. We present a tabu search procedure which is based on a decomposition of the problem into a mode assignment phase and a resource-constrained project scheduling phase with fixed mode assignments. Extensive computational experience, including a comparison with other local search methods, is reported. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 553–578, 1998     

Scheduling to minimize the total compression and late costs

We consider a single-machine scheduling model in which the job processing times are controllable variables with linear costs. The objective is to minimize the sum of the cost incurred in compressing job processing times and the cost associated with the number of late jobs. The problem is shown to be NP-hard even when the due dates of all jobs are identical. We present a dynamic programming solution algorithm and a fully polynomial approximation scheme for the problem. Several efficient heuristics are proposed for solving the problem. Computational experiments demonstrate that the heuristics are capable of producing near-optimal solutions quickly. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 67–82, 1998     

Heuristic procedures for scheduling job families with setups and due dates

This paper examines heuristic solution procedures for scheduling jobs on a single machine to minimize the maximum lateness in the presence of setup times between different job families. It reviews the state of knowledge about the solution of this problem, which is known to be difficult to solve in general, and examines natural solution approaches derived from some of the underlying theory. The emphasis is on the design and computational evaluation of new heuristic procedures. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 978–991, 1999     

试论对抗模拟的基本原理

对抗模拟是作战模拟中的一种重要方法,文章就其基本原理作了系统深入的探讨.通过中外专家的论述,阐述了对抗模拟概念的关键要素.通过对信息流动的分析,进一步剖析了对抗模拟的内涵.对抗模拟这种作战模拟形式具有仿真性、拟剧性、博弈性和不可重复性等特征.按照层次、信息提供的方式、结果评价的方式、实施的方式、运用的工具以及地域等区分了不同类型的对抗模拟.对抗模拟需要的关键仿真技术包括分布交互仿真、人工智能、虚拟现实以及信息网格等方面.     

军用安全模型扩展及其应用

在分析基于格理论的信息流控制军用安全模型在实际应用中存在的不足的基础上,从安全类定义和信息流控制策略两个方面对原模型进行了理论扩展和安全性分析.扩展模型安全类在作为对象和主体时具有相同的表达方式,以及在保持原模型信息流关系情况下,允许同职权等级用户交流他们共知的信息,以及高职权等级用户访问低职权等级用户他们之间共知的信息.以数字文档安全管理系统为例对扩展模型应用进行了描述.实例表明扩展模型更适合实际系统对信息流控制的要求.     

信息时代战场兵力组织的运作分析与设计

信息化战场空间、扁平化和网络化的兵力组织形式是未来网络中心战中作战部队编成的主要样式。为建立这一编成样式的设计方法和思路,以战场环境中兵力组织为例,分析了PCANS模型对信息时代组织测度的缺陷,在PCANS模型中引入信息因素描述组织的运作,并提出信息时代战场空间兵力组织设计的实质和目标以及设计方法。     

双时间隐式方法求解非定常绕流的相关问题

空间采用三阶精度的WeightedNND(WNND)格式,时间方向则采用具有二阶精度的双时间步隐式方法求解二维非定常Euler方程,数值模拟了NACA0012翼型俯仰强迫振动流场,讨论了内迭代步数、内迭代收敛判据以及物理时间步长对计算结果、计算效率与计算CPU时间的影响,并将计算结果与实验值进行了比较。     

Machine scheduling with pickup and delivery

The coordination of production, supply, and distribution is an important issue in logistics and operations management. This paper develops and analyzes a single‐machine scheduling model that incorporates the scheduling of jobs and the pickup and delivery arrangements of the materials and finished jobs. In this model, there is a capacitated pickup and delivery vehicle that travels between the machine and the storage area, and the objective is to minimize the makespan of the schedule. The problem is strongly NP‐hard in general but is solvable in polynomial time when the job processing sequence is predetermined. An efficient heuristic is developed for the general problem. The effectiveness of the heuristic is studied both analytically and computationally. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005.     

Non‐greedy heuristics and augmented neural networks for the open‐shop scheduling problem

In this paper we propose some non‐greedy heuristics and develop an Augmented‐Neural‐Network (AugNN) formulation for solving the classical open‐shop scheduling problem (OSSP). AugNN is a neural network based meta‐heuristic approach that allows integration of domain‐specific knowledge. The OSSP is framed as a neural network with multiple layers of jobs and machines. Input, output and activation functions are designed to enforce the problem constraints and embed known heuristics to generate a good feasible solution fast. Suitable learning strategies are applied to obtain better neighborhood solutions iteratively. The new heuristics and the AugNN formulation are tested on several benchmark problem instances in the literature and on some new problem instances generated in this study. The results are very competitive with other meta‐heuristic approaches, both in terms of solution quality and computational times. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005.